OMIS图像条带噪音消除方法研究

分析了OMIS高光谱图像条带噪音产生的主要原因及条带噪音的特点.提出了两种改进的空域和小波域OMIS条带噪音消除新方法.比较了实验图像和数据.结果表明,两种新方法均具有良好的消除OMIS条带噪音的能力,并能较好地保持图像的纹理细节信息,效果明显优于原有方法.     

Contrast enhancement of optical coherence tomography images using least squares fitting and histogram matching

A method of contrast enhancement of optical coherence tomography (OCT) images based on least squares fitting and histogram matching is presented. Several different functions are adopted as the probability density functions of the gray levels to fit the normalized histogram of an OCT image and histogram matching is used to enhance the OCT image automatically. The effectiveness of the method is proved by the experimental results.     

Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis

We present a new method for construction of high-order parametrizations of surfaces: starting from point clouds, the method we propose can be used to produce full surface parametrizations (by sets of local charts, each one representing a large surface patch – which, typically, contains thousands of the points in the original point-cloud) for complex surfaces of scientific and engineering relevance. The proposed approach accurately renders both smooth and non-smooth portions of a surface: it yields super-algebraically convergent Fourier series approximations to a given surface up to and including all points of geometric singularity, such as corners, edges, conical points, etc. In view of their C^∞ smoothness (except at true geometric singularities) and their properties of high-order approximation, the surfaces produced by this method are suitable for use in conjunction with high-order numerical methods for boundary value problems in domains with complex boundaries, including PDE solvers, integral equation solvers, etc. Our approach is based on a very simple concept: use of Fourier analysis to continue smooth portions of a piecewise smooth function into new functions which, defined on larger domains, are both smooth and periodic. The “continuation functions” arising from a function f converge super-algebraically to f in its domain of definition as discretizations are refined. We demonstrate the capabilities of the proposed approach for a number of surfaces of engineering relevance.     

ForceFit: A code to fit classical force fields to quantum mechanical potential energy surfaces

The ForceFit program package has been developed for fitting classical force field parameters based upon a force matching algorithm to quantum mechanical gradients of configurations that span the potential energy surface of the system. The program, which runs under UNIX and is written in C++, is an easy‐to‐use, nonproprietary platform that enables gradient fitting of a wide variety of functional force field forms to quantum mechanical information obtained from an array of common electronic structure codes. All aspects of the fitting process are run from a graphical user interface, from the parsing of quantum mechanical data, assembling of a potential energy surface database, setting the force field, and variables to be optimized, choosing a molecular mechanics code for comparison to the reference data, and finally, the initiation of a least squares minimization algorithm. Furthermore, the code is based on a modular templated code design that enables the facile addition of new functionality to the program. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2010     

Gouy phase compensation in quasi-phase matching

In any focussed nonlinear interaction the focus induced phase shift, known as the Gouy phase shift, provides an imperfection in phase matching for any linearly invariant material. However, using an appropriately designed quasi-phase matched structure it is theoretically possible to compensate for the deleterious effects of the Gouy phase shift, allowing a symmetric frequency response and tighter optimal focussing than in a uniform material.     

Dynamic data structures for fat objects and their applications

We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in or . Our planar structures are actually fitted for a more general class of objects – (β,δ)-covered objects – which are not necessarily convex, see definition below. These structures are more efficient than alternative known structures, because they exploit the fatness of the objects. We then apply these structures to obtain efficient solutions to two problems: (i) finding a perfect containment matching between a set of points and a set of convex fat objects, and (ii) finding a piercing set for a collection of convex fat objects, whose size is optimal up to some constant factor.     

Stochastic uniform observability of linear differential equations with multiplicative noise

The aim of this paper is to give a deterministic characterization of the uniform observability property of linear differential equations with multiplicative white noise in infinite dimensions. We also investigate the properties of a class of perturbed evolution operators and we used these properties to give a new representation of the covariance operators associated to the mild solutions of the investigated stochastic differential equations. The obtained results play an important role in obtaining necessary and sufficient conditions for the stochastic uniform observability property.     

Design of RLS Wiener fixed-lag smoother using covariance information in linear discrete stochastic systems

In this paper, we propose a new design for the recursive least-squares (RLS) Wiener fixed-lag smoother and filter in linear discrete-time wide-sense stationary stochastic systems. It is assumed that the signal is observed with additive white observation noise. The signal is uncorrelated with the observation noise. The estimators require knowledge of the system matrix, the observation matrix and the variance of the state vector. These quantities can be obtained from the auto-covariance function of the signal. In the estimation algorithms, moreover, the variance of the observation noise is assumed to be known, as a priori information.     

套链分解

Let X1,X2,...,Xk be k disjoint subsets of S with the same cardinality m.Define H(m,k) = {X (C) S: X (C) Xi for 1 ≤I ≤k} and P(m,k) = {X (C) S : X ∩ Xi ≠φ for at least two Xi's}.Suppose S = Uki=1 Xi,and let Q(m,k,2) be the collection of all subsets K of S satisfying|K ∩ Xi|≥ 2 for some 1 ≤ I ≤ k.For any two disjoint subsets Y1 and Y2 of S,we define F1,j = {X (C) S : either |X ∩ Y1|≥ 1 or |X ∩ Y2|≥ j}.It is obvious that the four posers are graded posets ordered by inclusion.In this paper we will prove that the four posets are nested chain orders.     

限位排序的若干结果

In this paper,we first consider the position restriction scheduling problems on a single machine.The problems have been solved in certain special cases,especially for those obtained by restricting the processing time pj=1.We introduce the bipartite matching algorithm to provide some polynomial-time algorithms to solve them.Then we further consider a problem on unrelated processors.